UnLattices, ConstructionB, and AGM Iterations
نویسندگان
چکیده
منابع مشابه
Fast evaluation of modular functions using Newton iterations and the AGM
Abstract. We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connection between the arithmetic-geometric mean (AGM) of complex numbers and modular functions. Through a detailed complexity analysis, we prove that for a given τ , evaluating N significative bits of j(τ) can be...
متن کاملAGM Theory and Artificial Intelligence
A very influential work on belief change is based on the seminal paper ‘On the Logic of Theory Change: Partial Meet Contractions and Revision Functions’. In this paper Alchourron, Gärdenfors, and Makinson investigate the properties that such a method should have in order to be intuitively appealing. The result was a set of postulates (named AGM postulates after the initials of the authors) that...
متن کاملRanking Functions, AGM Style
Ranking functions, having their first appearance under the name „ordinale Konditionalfunktionen“ in my Habilitationsschrift submitted in 1983, had several precursors of which I was only incompletely aware, among them Shackle’s functions of potential surprise (see Shackle 1969), Rescher’s plausibility indexing (see Rescher 1976), Adams’ ε-semantics (see Adams 1975), Cohen’s inductive probabiliti...
متن کاملIterable AGM functions
Appeared in Proceedings of BR'98. Trento. Italy. The AGM model has been criticized for not addressing the problem of iterated change. This is true, but in some cases the invalid claim that \AGM does not allow iteration" has been made. In this paper we examine the most elementary scheme of iteration: an iterable function. We formulate an iterable version of the AGM model, showing that the AGM fo...
متن کاملAGM postulates in Answer Sets
Revising and updating beliefs and knowledge bases is an important topic in knowledge representation and reasoning that requires a solid theoretical basis. As a result, various researchers have proposed Answer Set Programming as one of their key components to set up their approaches. In the need to satisfy more general principles, this paper presents a new characterisation of a semantics. It con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.0185